Computing Answer Sets of CR-Prolog Programs

نویسنده

  • Marcello Balduccini
چکیده

CR-Prolog is an extension of the knowledge representation language A-Prolog. The extension is built around the introduction of consistency-restoring rules (crrules for short), and allows an elegant formalization of events or exceptions that are unlikely, unusual, or undesired. The flexibility of the language has been extensively demonstrated in the literature, with examples that include planning and diagnostic reasoning. In this paper we present the design and implementation of an inference engine for CR-Prolog that is efficient enough to allow the practical use of the language for medium-size applications. The capabilities of the inference engine have been successfully demonstrated with experiments on an application independently developed for use by NASA.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a Theory of Intentional Agents

This paper describes the AIA architecture for agents whose behavior is driven by their intentions and who reason about, and act in, changing environments. The description of the domain, written in action language AL, includes both a description of agent’s environment and the Theory of Intentions which describes properties of intentions. The architecture is designed to make agents capable of exp...

متن کامل

Integrating Answer Set Reasoning with Constraint Solving Techniques

The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP allowing the separation of a program into two parts: a regular program of CR-Prolog and a collection of denials whose bodies contain constraints from C with variables ranging over large domains. We study an instance AC0 from t...

متن کامل

Splitting a CR-Prolog Program

CR-Prolog is an extension of A-Prolog, the knowledge representation language at the core of the Answer Set Programming paradigm. CR-Prolog is based on the introduction in A-Prolog of consistency-restoring rules (cr-rules for short), and allows an elegant formalization of events or exceptions that are unlikely, unusual, or undesired. The flexibility of the language has been extensively demonstra...

متن کامل

Planning and Scheduling in Hybrid Domains Using Answer Set Programming

In this paper we present an Action Language-Answer Set Programming based approach to solving planning and scheduling problems in hybrid domains domains that exhibit both discrete and continuous behavior. We use action language H to represent the domain and then translate the resulting theory into an A-Prolog program. In this way, we reduce the problem of finding solutions to planning and schedu...

متن کامل

On Logic Programming with Aggregates

In this paper, we present a translational semantics for normal logic programs with aggregates. We propose two different translations of logic programs with aggregates into normal logic programs, whose answer set semantics is used to defined the semantics of the original programs. Differently from many of the earlier proposals in this area, our semantics does not impose any syntactic restriction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006